Processor-Efficient Parallel Solution of Linear Systems II: The Positive Characteristic and Singular Cases (Extended Abstract)
نویسندگان
چکیده
We show that over any field, the solution set to a system of n linear equations in n unknowns can be computed in parallel with randomization simultaneously in poly-logarithmic time in n and with only as many processors as are utilized to multiply two n×n matrices. A time unit represents an arithmetic operation in the field. For singular systems our parallel timings are asymptotically as fast as those for non-singular systems, due to our avoidance of binary search in the matrix rank problem, except when the field has small positive characteristic; in that case, binary search is avoided at a somewhat higher processor count measure.
منابع مشابه
× — ’times‘
field, Proc. 3rd Annual ACM Symposium on Parallel Algorithms and Architectures, (1991), 180-191. 48. E.Kaltofen and V.Pan, Processor-efficient parallel solution of linear systems II The positive characteristic and singular cases, Proc. 33rd Annual IEEE Symposium on F.O.C.S. (1992), 714–723. 49. E.Kaltofen and B.D.Saunders, On Wiedemann’s method of solving sparse linear systems, in Proc. AAECC-5...
متن کاملParallel Solution of Toeplitz and Toeplitz-Like Linear Systems Over Fields of Small Positive Characteristic
We show that over a field of characteristic p the solution to a non-singular system of n linear equations in n unknows, with 2 ≤ p < n, whose coefficient matrix is of displacement rank α and which is given as a sum of α LU-products of Toeplitz matrices, can be computed in parallel with randomization simultaneously in O((log n)) time and a total work of O(max{αn, p}n× log n loglog n). A time uni...
متن کاملOptimal Control for Descriptor Systems: Tracking Problem (RESEARCH NOTE)
Singular systems have been studied extensively during the last two decades due Abstract to their many practical applications. Such systems possess numerous properties not shared by the well-known state variable systems. This paper considers the linear tracking problem for the continuous-time singular systems. The Hamilton-Jacobi theory is used in order to compute the optimal control and associa...
متن کاملComputer extended series and HAM for the solution of non-linear Squeezing flow of Casson fluid between parallel plates
The paper presents analysis of two-dimensional non-Newtonian incompressible viscous flow between parallel plates. The governing problem of momentum equations are reduced to NODE using similarity transformations. The resulting equation is solved using series solution and homotopy analysis method. These methods have advantages over pure numerical methods for obtaining the derived quantities accur...
متن کاملStatic Task Allocation in Distributed Systems Using Parallel Genetic Algorithm
Over the past two decades, PC speeds have increased from a few instructions per second to several million instructions per second. The tremendous speed of today's networks as well as the increasing need for high-performance systems has made researchers interested in parallel and distributed computing. The rapid growth of distributed systems has led to a variety of problems. Task allocation is a...
متن کامل